Causal Domain Restriction for Eikonal Equations
نویسندگان
چکیده
منابع مشابه
Causal Domain Restriction for Eikonal Equations
Many applications require efficient methods for solving continuous shortest path problems. Such paths can be viewed as characteristics of static Hamilton-Jacobi equations. Several fast numerical algorithms have been developed to solve such equations on the whole domain. In this paper we consider a somewhat different problem, where the solution is needed at one specific point, so we restrict the...
متن کاملA Fast Iterative Method for Eikonal Equations
In this paper we propose a novel computational technique to solve the Eikonal equation. The proposed method manages the list of active nodes and iteratively updates the solutions on those nodes until they converge. Nodes are added to or removed from the list based on a convergence measure, but the management of this list does not entail the the extra burden of expensive ordered data structures ...
متن کاملA fast sweeping method for Eikonal equations
In this paper a fast sweeping method for computing the numerical solution of Eikonal equations on a rectangular grid is presented. The method is an iterative method which uses upwind difference for discretization and uses Gauss-Seidel iterations with alternating sweeping ordering to solve the discretized system. The crucial idea is that each sweeping ordering follows a family of characteristics...
متن کاملFast Two-scale Methods for Eikonal Equations
Fast Marching and Fast Sweeping are the two most commonly used methods for solving the Eikonal equation. Each of these methods performs best on a different set of problems. Fast Sweeping, for example, will outperform Fast Marching on problems where the characteristics are largely straight lines. Fast Marching, on the other hand, is usually more efficient than Fast Sweeping on problems where cha...
متن کاملA Parallel Two-Scale Method for Eikonal Equations
Numerous applications of Eikonal equations prompted the development of many efficient numerical algorithms. The Heap-Cell Method (HCM) is a recent serial two-scale technique that has been shown to have advantages over other serial state-of-the-art solvers for a wide range of problems [A. Chacon and A. Vladimirsky, SIAM J. Sci. Comput., 34 (2012), pp. A547–A578]. This paper presents a paralleliz...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2014
ISSN: 1064-8275,1095-7197
DOI: 10.1137/130936531